Social Rationalizability
نویسندگان
چکیده
Social environments constitute a framework in which it is possible to study how groups of agents interact in a society. The framework is general enough to analyse both noncooperative and cooperative games. We identify a number of shortcomings of existing solution concepts that are used for social environments and propose a new concept called social rationalizability. The concept aims to identify the consequences of common knowledge of rationality and farsightedness within the framework of social environments. The set of socially rationalizable outcomes is shown to be non-empty for all social environments and it can be computed by an iterative reduction procedure. We introduce a de nition of coalitional rationality for social environments and show that it is satis ed by social rationalizability.
منابع مشابه
Rationalizability of choice functions on general domains without full transitivity
The rationalizability of a choice function by means of a transitive relation has been analyzed thoroughly in the literature. However, not much seems to be known when transitivity is weakened to quasi-transitivity or acyclicity. We describe the logical relationships between the different notions of rationalizability involving, for example, the transitivity, quasi-transitivity, or acyclicity of t...
متن کاملOn randomized rationality
In contrast to the traditional notion of rationalizability of stochastic choice which requires the preference relations to be strict, we propose a notion of rationalizability without requiring the preference relations to be strict. Our definition is based on the simple hypothesis of a two stage choice process: stage (i) a preference relation R is drawn according to a probability assignment; sta...
متن کاملRationalizing Distance Rationalizability
Distance rationalizability is an intuitive paradigm for developing and studying voting rules: given a notion of consensus and a distance function on preference profiles, a rationalizable voting rule selects an alternative that is closest to being a consensus winner. Despite its appeal, distance rationalizability faces the challenge of connecting the chosen distance measure and consensus notion ...
متن کاملRobust Dynamic Implementation∗
This paper provides a dynamic mechanism which fully implements any social choice function under initial rationalizability in complete information environments. Accommodating any belief revision assumption, initial rationalizability is the weakest among all the rationalizability concepts in extensive form games. This mechanism is also robust to small amounts of incomplete information about the s...
متن کاملA Dynamic Rationalization of Distance Rationalizability
Distance rationalizability is an intuitive paradigm for developing and studying voting rules: given a notion of consensus and a distance function on preference profiles, a rationalizable voting rule selects an alternative that is closest to being a consensus winner. Despite its appeal, distance rationalizability faces the challenge of connecting the chosen distance measure and consensus notion ...
متن کامل